New Algorithms for δγ-Order Preserving Matching
نویسندگان
چکیده
منابع مشابه
Algorithms for Order - Preserving Matching
in Computer Science. There have been many recent developments in this field. One fascinating problem considered lately is the order-preserving matching (OPM) problem. The task is to find all the substrings in the text which have the same length and relative order as the pattern, where the relative order is the numerical order of the numbers in a string. The problem finds its applications in the...
متن کاملAlternative Algorithms for Order-Preserving Matching
The problem of order-preserving matching is to find all substrings in the text which have the same relative order and length as the pattern. Several online and one offline solution were earlier proposed for the problem. In this paper, we introduce three new solutions based on filtration. The two online solutions rest on the SIMD (Single Instruction Multiple Data) architecture and the offline so...
متن کاملFiltration Algorithms for Approximate Order-Preserving Matching
The exact order-preserving matching problem is to find all the substrings of a text T which have the same length and relative order as a pattern P . Like string maching, order-preserving matching can be generalized by allowing the match to be approximate. In approximate order-preserving matching two strings match if they have the same relative order after removing up to k elements in the same p...
متن کاملFast Multiple Order-Preserving Matching Algorithms
Given a text T and a pattern P , the order-preserving matching problem is to find all substrings in T which have the same relative orders as P . Order-preserving matching has been an active research area since it was introduced by Kubica et al. [13] and Kim et al. [11]. In this paper we present two algorithms for the multiple order-preserving matching problem, one of which runs in sublinear tim...
متن کاملEfficient Algorithms for the Order Preserving Pattern Matching Problem
Given a pattern x of length m and a text y of length n, both over an ordered alphabet, the order-preserving pattern matching problem consists in finding all substrings of the text with the same relative order as the pattern. It is an approximate variant of the well known exact pattern matching problem which has gained attention in recent years. This interesting problem finds applications in a l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ingeniería
سال: 2018
ISSN: 2344-8393,0121-750X
DOI: 10.14483/23448393.13248